Machine Learnable Fold Space Representation based on Residue Cluster Classes
نویسندگان
چکیده
منابع مشابه
Maximal Machine Learnable Classes
A class of computable functions is maximal iff it can be incrementally learned by some inductive inference machine (IIM), but no infinitely larger class of computable functions can be so learned. Rolf Wiehagen posed the question whether there exist such maximal classes. This question and many interesting variants are answered herein in the negative. Viewed positively, each IIM can be infinitely...
متن کاملSplitting of Learnable Classes
A class L is called mitotic if it admits a splitting L0,L1 such that L,L0,L1 are all equivalent with respect to a certain reducibility. Such a splitting might be called a symmetric splitting. In this paper we investigate the possibility of constructing a class which has a splitting and where any splitting of the class is a symmetric splitting. We call such a class a symmetric class. In particul...
متن کاملEnlarging Learnable Classes
An early result in inductive inference shows that the class of Ex-learnable sets is not closed under unions. In this paper we are interested in the following question: For what classes of functions is the union with an arbitrary Ex-learnable class again Ex-learnable, either effectively (in an index for a learner of an Ex-learnable class) or noneffectively? We show that the effective case and th...
متن کاملGeneral Perspective on Distributionally Learnable Classes
Several algorithms have been proposed to learn different subclasses of context-free grammars based on the idea generically called distributional learning. Those techniques have been applied to many formalisms richer than context-free grammars like multiple context-free grammars, simple contextfree tree grammars and others. The learning algorithms for those different formalisms are actually quit...
متن کاملClasses with Easily Learnable Subclasses
In this paper we study the question of whether identifiable classes have subclasses which are identifiable under a more restrictive criterion. The chosen framework is inductive inference, in particular the criterion of explanatory learning (Ex) of recursive functions as introduced by Gold in 1967. Among the more restrictive criteria is finite learning where the learner outputs, on every functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Biology and Chemistry
سال: 2015
ISSN: 1476-9271
DOI: 10.1016/j.compbiolchem.2015.07.010